#include<bits/stdc++.h>
using namespace std;
inline long long read(){
    char ch=getchar();
    long long x=0,k=1;
    while(ch<'0'||ch>'9'){
        if(ch=='-') k=-1;
        ch=getchar();}
    while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*k;}
const int maxn=100005;
long long a[maxn],b[maxn];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    long long T,l,r,flag;
    T=read();
    for(long long i=1;i<=T;i++) a[i]=read();
    sort(a+1,a+T+1),l=1,r=1,flag=1;
    for(long long i=1;i<=T;i++){
        if(a[i]<a[i+1]) b[flag]=r-l+1,flag++,l=i+1,r=l;
        else{
            if(i<T) r++;
            else b[flag]=r-l+1;}}
    sort(b+1,b+flag+1);
    cout<<b[flag]<<'\n';
    return 0;}
//Sally
